On Optimally Partitioning Variable-Byte Codes
نویسندگان
چکیده
منابع مشابه
Perfect Byte-Correcting Codes
We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single bytecorrecting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist wh...
متن کاملEnhanced Byte Codes with Restricted Prefix Properties
Byte codes have a number of properties that make them attractive for practical compression systems: they are relatively easy to construct; they decode quickly; and they can be searched using standard byte-aligned string matching techniques. In this paper we describe a new type of byte code in which the first byte of each codeword completely specifies the number of bytes that comprise the suffix...
متن کاملSome Results on Bit/byte Bounded Codes and Proximity Detecting Codes (a Brief Note)
y Abstract This report presents some new results on two classes of codes: (t; u)-bit/byte bounded codes that can handle up to u bytes in error, provided that each byte contains at most t erroneous bits, and t-proximity detecting codes that can detect if a received word is within distance t of the transmitted codeword.
متن کاملNew Double-Byte Error-Correcting Codes for Memory Systems
Error-correcting or error-detecting codes have been used in the computer industry to increase reliability, reduce service costs, and maintain data integrity. The single-byte error-correcting and double-byte error-detecting (SbEC-DbED) codes have been successfully used in computer memory subsystems. There are many methods to construct double-byte error-correcting (DbEC) codes. In the present pap...
متن کاملOn the Analysis of Variable-to-Variable Length Codes
We use the \conservation of entropy" 1] to derive a simple formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources. We obtain new asymptotic upper bounds on the redundancy of the \Tunstall-Huuman" code and the \Tunstall-Shannon-Fano" code. For some sources we provide the best existing upper bound for the smallest achievable asymptotic red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2020
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2019.2911288